Method for allocating signature sequence in CDMA system

ABSTRACT

A method for allocating signature sequence used to distinguish my own signal from the other user&#39;s signals in a code division multiple access system comprising the steps of obtaining and selecting a Park-Song sequence based upon a specific equations; allocating the selected Park-Song sequence as the signature sequence to the pertinent user; performing communications using the allocated signature sequence; and generating the signature sequence as the Park-Song sequence added to the beginning and ending ‘patches’ of itself at both ends.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method for allocating signature sequence in a CDMA system, and more particularly to a method for allocating signature sequence capable of minimizing interference among users using Park-Song (PS) sequence in a CDMA system.

2. Description of the Prior Art

Generally, a multiple access technique is a method through which a plurality of users send and receive signals at the same time, and is divided into the time division multiple access (TDMA), a frequency division multiple access (FDMA) and the code division multiple access (CDMA).

A primary object of the multiple access is that a plurality of signals do not allow to be overlapped, that is, to be jammed up in cases where a plurality of users give and take signals at the same time.

First, the TDMA of the time dividing method capable of thinking out most easily sends signals in regular time sequence. For example, a system respectively allocates a pertinent number to ten users for ten users. In this case, if any user transmits a signal, the other users interrupt transmission of signals and transmit a signal only in the case of his own order.

Second, the FDMA of the frequency dividing method is the method in which a system allocates frequencies different from each other to each user and sends the signal of the pertinent frequency. For example, a system allocates 0 to 5 kHz to one and 5 to 10 kHz to another so as to allocate different frequency bands to every user for ten users.

As described above, these TDMA and FDMA divide respectively time and frequency and use the results. That is, the TDMA divides time while sharing frequency, on the other hand the FDMA divides frequency while sharing time.

Meanwhile, the CDMA of the code dividing method is the method capable of sharing both time and frequency. Therefore, signals of a plurality of users are overlapped in both areas of time and frequency. A new method of finding out the only signal corresponding to oneself of the signals is required, and thus a system allocates codes to each user to accomplish such object.

In addition, a sequence means a queue of a number such as “1, 0, 0, 1, 1, . . . , 0, 1”. That is, the sequence is that the number is continued in accordance with a prescribed rule. Particularly, as mentioned above the sequence consisted of ‘0’ and ‘1’ is called a binary sequence, the most representative binary sequence is PN sequence widely used in the CDMA recently.

The most important characteristics of the sequence is auto-correlation and cross-correlation. The auto-correlation is a characteristics of the case of multiplying and adding one sequence and itself, and the cross-correlation is a characteristics of the case of multiplying and adding one sequence and another. A good sequence satisfies the following matters, in cases where the length of the sequence is N.

auto-correlation=N, cross-correlation=0

Meanwhile, when the system allocates k sequences having the same length to k users, the allocated sequences are called codes. As shown in FIG. 1, sequences multiplied by information data are called a spreading codes or codes in the case of sending the information data from a transmission side. Such codes are differently allocated every users in CDMA system. Thus, the most important characteristics of the CDMA start from auto-correlation and cross-correlation of the different codes. That is, if one hopes to find out a desired signal, namely, information data, the system multiplies the signal by the code of signal sending one. Then, the signal is converted into the original information data, and signals of the other users become zero by the cross-correlation characteristics.

However, there are several problems actually. First, it is difficult to make the cross-correlation zero. Second, if his own signal is arrived a little later in the auto-correlation, the signal must be become zero, but actually the signal is not zero.

Therefore, the present invention suggests a sequence superior to the prior PN sequence in view of the auto-correlation and cross-correlation, and further suggests a method applicable to CDMA.

SUMMARY OF THE INVENTION

Therefore, an object of the present invention is to provide a method for allocating signature sequence in a CDMA system capable of minimizing interference among users using Park-Song sequence of improving auto-correlation and cross-correlation characteristics.

In accordance with the present invention, this object is accomplished by providing a method for allocating signature sequence used to distinguish my own signal from the other user's signals in a code division multiple access system comprising the steps of: obtaining a Park-Song sequence c_(l,k) based upon an equation (1) and selecting the Park-Song sequence based upon an equation (2), $\begin{matrix} {c_{l,k} = {{\sum\limits_{p = 0}^{N_{4} - 1}{W_{N_{s}}^{lk}W_{V}^{v_{t}}W_{N_{4}^{i2}}^{lp}{\delta \left( {R\left( {{l + {mp}},N_{b}} \right)} \right)}}} = W_{V_{s}}^{i_{s}}}} & (1) \\ {{where},{i_{s} = {{{Vl}\left( {k + {Kp}_{s}} \right)} + {{P\left( \beta_{p_{s}} \right)}N_{s}}}},{V_{s} = {VN}_{s}},{{and}\quad p_{s}}} & \quad \\ {{{{satisfies}\quad {R\left( {{l + {m\quad p_{s}}},N_{b}} \right)}} = 0},} & \quad \\ \begin{matrix} {a_{l}^{(k)} = \left\{ \begin{matrix} {c_{{l + N},{- L},k},} & {{{{if}\quad l} = 0},1,\ldots \quad,{L - 1},} \\ {c_{{l - L},k},} & {{{{if}\quad l} = L},{L + 1},\ldots \quad,{L + N_{s} - 1},} \\ {c_{{l + N},{- L},k},} & {{{{if}\quad l} = {L + N_{s}}},{L + N_{s} + 1},\ldots \quad,{N - 1.}} \end{matrix} \right.} \\ {{= c_{{R{({{l + N},{- L},N_{s}})}},k}},{l = 0},1,\ldots \quad,{N - 1},{k = 0},1,\ldots \quad,{K_{u} - 1.}} \end{matrix} & (2) \end{matrix}$

where, L is a natural number chosen based upon the number of resolvable paths and the time delays, K_(u) is the number of users, and N=N_(s)+2L is the length of the signature sequence; allocating the selected Park-Song sequence as the signature sequence to the pertinent user; and performing communications using the allocated signature sequence.

BRIEF DESCRIPTION OF THE DRAWINGS

Other objects and aspects of the invention will become apparent from the following description of embodiments with reference to the accompanying drawings in which:

FIG. 1 is a schematic diagram illustrating a code division multiple access system;

FIG. 2 is a graph illustrating auto-correlation function of Park-Song sequence;

FIG. 3 is a graph illustrating cross-correlation function of Park-Song sequence;

FIG. 4 is a view illustrating signature sequence consisted of Park-Song sequence according to the present invention;

FIG. 5 is a view illustrating a reception signals in a code division multiple access system according to the present invention; and

FIGS. 6a and 6 b are a graph comparing the prior PN sequence with Park-Song sequence according to the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The objects, characteristics and advantages of the above-described invention will be more clearly understood through the preferable embodiments referring to the attached drawings.

Since the terms mentioned later are judged based upon the function of the present invention and they can be changed according to the technician's intention or a usual practice, the terms should be judged considering the overall contents of the specification of the present invention.

First, a discrete Fourier transform matrix of size N×N with index m is defined as

F _(N,m) =[W _(N) ^(−klm])  (1)

where, m is a natural number, k, l=0, 1, . . . , N−1, W_(N)=e^(2πj/N), and j={square root over (−1)}.

In addition, a diagonalized matrix D({x_(l)})) of a sequence {x_(l)} is defined as

D({x _(l)})=diag({x _(l)}).  (2)

Next, when α and q are integers, β is a natural number, and α=qβ+r with r=0, 1, . . . , β−1, a quotient function Q and a residual function R are defined as

Q(α,β)=q, R(α,β)=r.  (3)

Here, N_(b) symbols β_(i), i=0, 1, . . . , N_(b)−1, all with equal magnitude is called basic complex symbols. At this time, we assume β_(i) are located on the unit circle of the complex plane. For example, {W₃ ^(θ)=1, W₃, W₃ ²} is a set of basic complex symbols.

First, an orthogonal sequence is generated from {β_(i)}. For a set {β_(i)} of basic complex symbols and 1≦m≦N_(b)−1, a basic orthogonal sequence matrix G of size N_(b)×N_(b) is defined as

G=F _(nb,m) ⁻¹ D({β_(i)}).  (4)

Next, a basic orthogonal sequence {g_(p)} of length N² _(b) is defined by $\begin{matrix} \begin{matrix} {g_{p} = G_{{Q{({p,N_{b}})}},{R{({p,N_{b}})}}}} \\ {{= {\beta_{R{({p,N_{b}})}}W_{N_{b}}^{{Q{({p,N_{b}})}}{R{({p,N_{s}})}}m}}},{p = 0},1,\ldots \quad,{N_{b}^{2} - 1.}} \end{matrix} & (5) \end{matrix}$

where, G_(ab) means the ath row, bth column element of G. Using the basic orthogonal sequence {g_(p)}, N_(s)×K matrix H is made as

H=[h _(i,k)]  (6)

where, $h_{i,k} = {\sum\limits_{p = 0}^{N_{b}^{2} - 1}{g_{p}{{\delta \left( {i - k - {pK}} \right)}.}}}$

N_(s)=KN² ², and K is a natural number. The first column of H is composed of g₀ followed by K−1 0's, g₁ followed by K−1 0's, . . . , and g_(N) _(b) _(²) ⁻¹ followed K−1 0's. Other columns of H are shifted vectors of the first column.

Now, a PS sequence matrix C of size N_(s)×K is defined as $\begin{matrix} {C = {{\frac{1}{N_{b}}F_{N_{s},1}^{- 1}H} = \left\lbrack c_{l,k} \right\rbrack}} & (7) \end{matrix}$

where, $c_{l,k} = {W_{N_{s}}^{lk}{\sum\limits_{p = 0}^{N_{b} - 1}{\beta_{p}W_{N_{b}^{2}}^{lp}{{\delta \left( {R\left( {{l + {mp}},N_{b}} \right)} \right)}.}}}}$

At this time, a sequence {c_(l,k), l=0, 1, . . . , N_(s)−1} is called the PS sequence. For example, let {β_(i)}={1, W₃, W₃ ²} N_(b)=3, m=1, and K=2. Then, $\begin{matrix} {G = {{\begin{bmatrix} 1 & 1 & 1 \\ 1 & W_{3} & W_{3}^{2} \\ 1 & W_{3}^{2} & W_{3} \end{bmatrix}\begin{bmatrix} 1 & 0 & 0 \\ 0 & W_{3} & 0 \\ 0 & 0 & W_{3}^{2} \end{bmatrix}} = \begin{bmatrix} 1 & W_{3} & W_{3}^{2} \\ 1 & W_{3}^{2} & W_{3} \\ 1 & 1 & 1 \end{bmatrix}}} & (8) \end{matrix}$

and {g_(p)}={1, W₃, W₃ ², W₃, 1, 1, 1,}

Then, $\begin{matrix} {H = {{\begin{bmatrix} 1 & 0 & W_{3} & 0 & W_{3}^{2} & 0 & 1 & 0 & W_{3}^{2} & 0 & W_{3} & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\ 0 & 1 & 0 & W_{3} & 0 & W_{3}^{2} & 0 & 1 & 0 & W_{3}^{2} & 0 & W_{3} & 0 & 1 & 0 & 1 & 0 & 1 \end{bmatrix}^{T}.}}} & (9) \end{matrix}$

Then, the PS sequence matrix C is $\begin{matrix} \begin{matrix} {C = \quad {\frac{1}{3}F_{18.1}^{- 1}H}} \\ {= \quad \left\lbrack \begin{matrix} W_{18}^{0} & W_{18}^{16} & W_{18}^{10} & W_{18}^{0} & W_{18}^{10} & W_{18}^{16} & W_{18}^{0} & W_{18}^{4} & W_{18}^{4} \\ W_{18}^{0} & W_{18}^{17} & W_{18}^{12} & W_{18}^{3} & W_{18}^{14} & W_{18}^{3} & W_{18}^{6} & W_{18}^{11} & W_{18}^{12} \end{matrix} \right.} \\ {\left. \quad \begin{matrix} W_{18}^{0} & W_{18}^{16} & W_{18}^{10} & W_{18}^{0} & W_{18}^{10} & W_{18}^{16} & W_{18}^{0} & W_{18}^{4} & W_{18}^{4} \\ W_{18}^{9} & W_{18}^{8} & W_{18}^{3} & W_{18}^{12} & W_{18}^{5} & W_{18}^{12} & W_{18}^{15} & W_{18}^{2} & W_{18}^{3} \end{matrix} \right\rbrack^{T}.} \end{matrix} & (10) \end{matrix}$

Therefore, the PS sequences are $\begin{matrix} \begin{matrix} {c_{l,0} = \left\{ \quad {W_{18}^{0},W_{18}^{16},W_{18}^{10},W_{18}^{0},W_{18}^{10},W_{18}^{16},W_{18}^{0},W_{18}^{4},W_{18}^{4},} \right.} \\ {{\quad \left. {W_{18}^{0},W_{18}^{16},W_{18}^{10},W_{18}^{0},W_{18}^{10},W_{18}^{16},W_{18}^{0},W_{18}^{4},W_{18}^{4}} \right\}},} \end{matrix} & (11) \\ \begin{matrix} {c_{l,1} = \left\{ \quad {W_{18}^{0},W_{18}^{17},W_{18}^{12},W_{18}^{3},W_{18}^{14},W_{18}^{3},W_{18}^{6},W_{18}^{11},W_{18}^{12},} \right.} \\ {{\quad \left. {W_{18}^{9},W_{18}^{8},W_{18}^{3},W_{18}^{12},W_{18}^{5},W_{18}^{12},W_{18}^{15},W_{18}^{2},W_{18}^{3}} \right\}}.} \end{matrix} & \quad \end{matrix}$

Next, a simpler generation method than the explained matrix multiplications is introduced when generating the PS sequence.

First we can assume β_(p)ε{W_(V) ^(i), i=0, 1, . . . , V−1}, where V is a natural number. Consider a function P defined by P(β_(p))=ν_(p) when β_(p)=W_(V) ^(i). Then, the c_(l,k) of equation (7) becomes $\begin{matrix} {c_{l,k} = {{\sum\limits_{p = 0}^{N_{b} - 1}{W_{N_{s}}^{lk}W_{V}^{v_{b}}W_{N_{b}^{2}}^{lp}{\delta \left( {R\left( {{l + {mp}},N_{b}} \right)} \right)}}} = W_{V_{s}}^{L}}} & (12) \end{matrix}$

where, W_(N) _(s) =e^(j2π/N) ^(_(s)) , W_(V)=e^(j2π/V), W_(N) _(b) _(²) =e^(j2π/N) ^(_(b)) ² , W_(V) _(s) =e^(j2π/V) ^(_(s)) , N_(s)=KN_(b) ² is the length of the Park-Song sequence, V is a natural number, N_(b) is the size of a basic complex symbol, m is a natural number less than N_(b), i_(s)=Vl(k+Kp_(s))+P(β_(Ps))N_(s), V_(s)=VN_(s), K is the maximum number of users, p_(s) is the number satisfying R(l+mp_(s), N_(b))=0, the function P is defined by P(β_(P))=ν_(P) when β_(P)=W_(V) ^(ν) ^(_(P)) , δ(•) is the Kronecker delta function, R(a,b) is the remainder when a is divided by b, β_(P)ε{W_(V) ^(i),i=0,1, . . . , V−1} is a basic complex symbol, e=2.718 . . . is the base of the natural logarithm, and j={square root over (−1)}.

That is, the equation (12) shows that the PS sequence can be obtained by using only integer sums and modular operations. Tables 1 and 2 represent indices of sequences generated when selecting the PS sequence represented in the equation (11) as V=N_(b)=3 in the equation (12).

TABLE 1 k = 0, K = 2, m = 1, N_(b) = 3, N_(s) = 18, V = 3 l p_(s) R(i_(s), N_(s)) l p_(s) R(i_(s), N_(s)) 0 0 0 9 0 0 1 2 16 10 2 16 2 1 10 11 1 10 3 0 0 12 0 0 4 2 10 13 2 10 5 1 16 14 1 16 6 0 0 15 0 0 7 2 4 16 2 4 8 1 4 17 1 4

TABLE 2 k = 1, K = 2, m = 1, N_(b) = 3, N_(s) = 18, V = 3 l p_(s) R(i_(s), N_(s)) l p_(s) R(i_(s), N_(s)) 0 0 0 9 0 9 1 2 17 10 2 8 2 1 12 11 1 3 3 0 3 12 0 12 4 2 14 13 2 5 5 1 3 14 1 12 6 0 6 15 0 15 7 2 11 16 2 2 8 1 12 17 1 3

Meanwhile, the auto-correlation function of the PS sequence is $\begin{matrix} \begin{matrix} {{A(\tau)} = \quad {{\sum\limits_{l = 0}^{N_{s} - 1 - \tau}\quad {c_{{l + \tau},k}c_{l,k}^{*}}} + {\sum\limits_{l = {N_{s} - \tau}}^{N_{s} - 1}\quad {c_{{l + \tau - N_{s}},k}c_{l,k}^{*}}}}} \\ {= \quad {N_{s}W_{N}^{\tau \quad k}{{\delta \left( {R\left( {\tau,N_{b}^{2}} \right)} \right)}.}}} \end{matrix} & (13) \end{matrix}$

As shown in the equation (13) and FIG. 2, the auto-correlation function has a nonzero value only when τ=iN² _(b), i=0, 1, . . . , K−1: the nonzero interval can be controlled by properly choosing the value of N_(b).

On the other hand, let us denote two PS sequences as {c^(I) _(l,k)} and {c^(II) _(l,k,)}. Then, the cross-correlation function of the two sequences is $\begin{matrix} \begin{matrix} {{C(\tau)} = \quad {{\sum\limits_{l = 0}^{N_{s} - 1 - \tau}\quad {c_{{l + \tau},k}^{I}c_{l,k}^{{II}*}}} + {\sum\limits_{l = {N_{s} - \tau}}^{N_{s} - 1}\quad {c_{{l + \tau - N_{s}},k}^{I}c_{l,k}^{{II}*}}}}} \\ {{= \quad {{KN}_{b}W_{N,}^{\tau \quad k^{i}}{\sum\limits_{p = 0}^{N_{b} - 1}\quad {\sum\limits_{q = 0}^{N_{b} - 1}\quad {\beta_{p}^{I}\beta_{q}^{{II}*}W_{N_{b}^{2}}^{\tau \quad p}}}}}}\quad} \\ {\quad {{\delta \left( {R\left( {{\tau + {m^{I}p} - {m^{II}q}},N_{b}} \right)} \right)}\quad {{\delta \left( \left\{ {k^{I} - k^{II} + {K\left( {p - q} \right)}} \right\} \right)}.}}} \end{matrix} & (14) \end{matrix}$

where, * represents a complex conjugate and the superscripts I and II of k, m and β are used to distinguish the two sequences.

Meanwhile, Table 3 and FIG. 3 show the norlized absolute values of the cross-correlation function for 3 distinct cases.

TABLE 3 Cross-correlation function (normalized absolute values) conditions |C(τ)|/N_(s), τ = 0, 1, . . . , N_(s) − 1 k^(I) ≠ k^(II) 0 k^(I) = k^(II) = k, m^(I) ≠ m^(II) $\frac{1}{N_{b}}$

k^(I) = k^(II) = k, m^(I) = m^(II), {β^(I)} ≠ {β^(II)} $\frac{1}{N_{b}}{{\sum\limits_{\rho = 0}^{N_{b} - 1}\quad {\beta_{\rho}^{I}\beta_{\rho}^{{II}*}W_{N_{b}^{2}}^{cp}}}}{\delta \left( {R\left( {\tau,N_{b}} \right)} \right)}$

In the first case k^(I)≠k^(II), we see the normalized absolute cross-correlation function is 0. In this case, the cross-correlation is independent of the value of the other parameters, m, {β_(i)}. Next, when k^(I)=k^(II)=k and m^(I)≠m^(II), the absolute value of the normalized cross-correlation function is 1/N_(b). Finally, when k^(I)=k^(II)=k, m^(I)=m^(II), and {β_(i) ^(I)}≠{_(i) ^(II)} (in other words, when only the β_(i)'s of two sequence are different), the normalized absolute value of the cross-correlation function is 0 except for τ=nN_(b), n=0, ±1, ±2, . . . , ±(KN_(b)−1). In this case, if we focus on the zero-shifted interval (τ=0) of the cross-correlation, the normalized absolute value can be made to be 0 at τ=0 by choosing β_(i)'s satisfy ${\sum\limits_{p = 0}^{N_{b} - 1}\quad {\beta_{p}^{I}\beta_{p}^{{II}*}}} = 0.$

Next, an m_(k)-subset of the PS sequence is defined as a collection of PS sequences generated with the same values of m and k and the different value of {β_(i)}, and a k-class of the PS sequence is defined as the collection of m_(k)-subsets having the same value of k. Thus, the explained correlation characteristics are summarized by the following theorems.

Theorem 1. The auto-correlation function of the PS sequence is zero except when the time difference is a multiple of the square of the number of the basic symbols.

Theorem 2. Two PS sequences chosen from different k-classes have no cross-correlation.

Theorem 3. The absolute value of the cross-correlation between two PS sequences chosen from different m_(k)-subsets of a k-class is 1/N_(b).

Theorem 4. IF ${{\sum\limits_{p = 0}^{N_{b} - 1}\quad {\beta_{p}^{I}\beta_{p}^{{II}*}}} = 0},$

the absolute value of the cross-correlation between two PS sequences chosen from the same m_(k)-subset is zero for τ=0 and iN_(b)<|τ|<(i+1)N_(b), i=1, 2, . . . , KN_(b)−2.

Next, procedures for allocating the signature sequence to the user using the PS sequence in CDMA system are explained.

First, let us assume that there are K_(u) users in the CDMA system. Then, the PS sequence used as the signature sequence are selected by the following two methods.

Ths first method selects one PS sequence each from different k-classes. Then, K_(u)=K. In addition, the second selection method selects N_(b) PS sequences satisfying the Theorem 4 each from different k-classes. Then, K_(u)=KN_(b).

Since the correlation functions of the PS sequence exhibit periodicity as described above, it is not desirable to use the PS sequence directly as the signature sequence except for perfectly synchronous cases.

Therefore, a patching method is used for assigning the signature sequence to each user. Particularly, the following signature sequence is assigned to each user for the first selection method. $\begin{matrix} \begin{matrix} {a_{L}^{(k)} = \quad \left\{ \quad \begin{matrix} {c_{{l + N_{s} - L},k},} & {{{{if}\quad l} = 0},1,\ldots \quad,{L - 1},} \\ {c_{{I - L},k},} & {{{{if}\quad l} = L},{L + 1},\cdots \quad,{L + N_{s} - 1},} \\ {c_{{I + N_{s} - L},k},} & {{{{if}\quad l} = {L + N_{s}}},{L + N_{s} + 1},\cdots \quad,{N - 1},} \end{matrix} \right.} \\ {= \quad {{\begin{matrix} {c_{{R{({{l + N_{s} - L},N_{s}})}},k},} & {{l = 0},1,\cdots \quad,{N - 1},\quad {k = 0},1,\cdots \quad,} \end{matrix}\quad K_{u}} - 1.}} \end{matrix} & (15) \end{matrix}$

where, L is a natural number chosen based upon the number of resolvable paths and time delay of the communication channel, N=N_(s)+2L is the length of the signature sequence, and K_(u) is the number of active users in the system. The signature sequence made in accordance with the invention is the PS sequence added to the beginning and ending ‘patches’ of itself at both ends, as shown in FIG. 4. In this case, in order to fully exploit the excellent correlation properties of the PS sequence, the number L should satisfy $\begin{matrix} {{{\min \left\{ \left\lfloor \frac{\tau^{(k)}}{T_{c}} \right\rfloor \right\}} \geq {- L}},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},{{\max \left\{ {\left\lceil \frac{\tau^{(k)}}{T_{c}} \right\rceil + L_{p}^{(k)}} \right\}} \leq L},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},\quad {L < {N_{b}^{2}.}}} & (16) \end{matrix}$

where, └x┘ represents the largest integer less than or equal to x, {T^(lk)} are independent and identically distributed by time delays for user k with the uniform distribution over [−αT, αT], T_(c) is the chip duration time, ┌x┐ represents the smallest integer greater than or equal to x, and L_(p) ^((k)) is the number of resolvable paths for user k. Here, T=NT_(c) is the symbol period. In most practical cases, α<<1, L_(p)≅4, αT/T_(c)≅2, and L≅7. FIG. 5 shows a diagram of the received signals in the suggested system.

Meanwhile, for the second selection method, L satisfies L<N_(b) in place of L<N² _(b) of the condition (16).

Table 4 shows the number of users and spreading gains for the two selection methods when L=6 and 7. As known in Table 4, it is clear that the number of users are quite different depending on the selection method even if the spreading gain is almost the same.

TABLE 4 The The first selection method second selection method Number of Spreading Number of Sreading users(N) gains(K_(u)) users(N) gains(K_(u)) L = 6 111 11 110 14 255 27 257 35 561 61 551 77 1056 116 1041 147 L = 7 113 11 142 16 257 27 270 32 563 61 526 64 1058 116 1038 128

Meanwhile, a despreading sequence for user k is a similarly pattched PS sequence defined as $\begin{matrix} {d_{l}^{(k)} = \left\{ \begin{matrix} {0,} & {{{{if}\quad l} = 0},1,\ldots \quad,{L - 1},} \\ {c_{{l - L},{ki}},} & {{{{if}\quad l} = L},{L + 1},\cdots \quad,{L + N_{s} - 1},} \\ {0,} & {{{{if}\quad l} = {L + N_{s}}},{L + N_{s} + 1},\cdots \quad,{N - 1.}} \end{matrix}\quad \right.} & (17) \end{matrix}$

FIGS. 6a and 6 b are a graph comparing symbol error probabilities of the system using the conventional PN sequence with those using the PS sequence according to the present invention. FIG. 6a is the case of the short length of sequence and p=1, L_(p)=4, δ=0.2, M=2, N=194, L=7, N_(s)=180, and L_(r)=1.4, and FIG. 6b is the case of the long length of sequence and p=1, L_(p)=4, δ=0.2, M=2, N=464, L=7, L_(s)=450, and L_(r)=1.4.

In FIGS. 6a and 6 b, it is clear that the symbol error probability of the system using the PN sequence when the number of users increases. In addition, SNR of approximately 10 dB is required for 10 users in the case of using the PN sequence, while only SNR of approximately 6 dB is required even for 20 users in the case of using the PS sequence.

Further, the symbol error probability is not affected by the length of the sequence and the number of users in the case of using the PS sequence.

As described above, the method for allocating signature sequence using Park-Song sequence to each user in a CDMA system is capable of minimizing interference among the users and further be realized easily since the PS sequence can be obtained by only integer sums and modular operations.

Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims. 

What is claimed is:
 1. A method for allocating signature sequence used to distinguish a particular user's signal from the other users' signals in code division multiple access systems comprising the steps of: obtaining a k-th Park-Song sequence {C_(l,k)}_(l=0) ^(N) ^(_(s)) ⁻¹ of length N_(s) for k=1,2, . . . , K, based upon Equation (1); selecting a Park-Song sequence as a signature sequence {α_(l) ^((k))}_(l=0) ^(N−1) of length N, based upon Equation (2); and allocating the selected Park-Song sequence as the signature sequence to user k, $\begin{matrix} {{c_{l,k} = {{\sum\limits_{p = 0}^{N_{b} - 1}\quad {W_{N_{s}}^{lk}W_{V}^{v_{P}}W_{N_{b}^{2}}^{lp}{\delta \left( {R\left( {{l + {mp}},N_{b}} \right)} \right)}}} = W_{V_{s}}^{i_{s}}}},} & (1) \end{matrix}$

where, W_(N) _(s) =e^(j2π/N) ^(_(s)) , W_(V)=e^(j2π/V), W_(N) _(b) _(²) =e^(j2π/N) ^(_(b)) ² , W_(V) _(s) =e^(j2π/V) ^(_(s)) , N_(s)=KN_(b) ² is the length of the Park-Song sequence, V is a natural number, N_(b) is the size of a basic complex symbol, m is a natural number less than N_(b), i_(s)=Vl(k+Kp_(s))+P(β_(p) _(s) )N_(s), V_(s)=VN_(s), K is the maximum number of users, p_(s) is the number satisfying R(l+mp_(s), N_(b))=0, the function P is defined by P(β_(p))=ν_(p) when β_(p)=W_(V) ^(ν) ^(_(p)) , δ(•) is the Kronecker delta function, R(a,b) is the remainder when a is divided b, β_(p)ε{W_(V) ^(i), i=0,1, . . . , V−1} is a basic complex symbol, e=2.718 . . . is the base of the natural logarithm, and j={square root over (−1)}, $\begin{matrix} \begin{matrix} {a_{l}^{(k)} = \quad \left\{ \quad \begin{matrix} {c_{{l + N_{s} - L},k},} & {{{{if}\quad l} = 0},1,\ldots \quad,{L - 1},} \\ {c_{{l - L},k},} & {{{{if}\quad l} = L},{L + 1},\ldots \quad,{L + N_{s} - 1},} \\ {c_{{l + N_{s} - L},k},} & {{{{if}\quad l} = {L + N_{s}}},\quad {L + N_{s} + 1},\ldots \quad,{N - 1}} \end{matrix}\quad  \right.} \\ {{= \quad \begin{matrix} {c_{{R{({{l + N_{s} - L},N_{s}})}},k},} & {{l = 0},1,\ldots \quad,{N - 1},{k = 0},1,\ldots \quad,{K_{u} - 1},} \end{matrix}}\quad} \end{matrix} & (2) \end{matrix}$

where, L is a natural number chosen based upon the number of resolvable paths and time delay of the communication channel, N=N_(s)+2L is the length of the signature sequence, and K_(u) is the number of active users in the system.
 2. The method according to claim 1, wherein said Park-Song sequence selecting step selects the Park-Song sequence with L satisfying the following conditions, $\begin{matrix} {{{\min \left\{ \left\lfloor \frac{\tau^{(k)}}{T_{c}} \right\rfloor \right\}} \geq {- L}},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},{{\max \left\{ {\left\lceil \frac{\tau^{(k)}}{T_{c}} \right\rceil + L_{p}^{(k)}} \right\}} \leq L},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},\quad {L < {N_{b}^{2}.}}} & (3) \end{matrix}$

where, └x┘ represents the largest integer less than or equal to x, {τ^((k))} are independent and identically distributed by time delays for user k with the uniform distribution over [−αT, αT], T_(c) is the chip duration time, ┌x┐ represents the smallest integer greater than or equal to x, and L_(p) ^((k)) is the number of resolvable paths for user k, here, T=NT_(c) is the symbol period.
 3. The method according to claim 1, wherein said Park-Song sequence selecting step selects the Park-Song sequence with L satisfying the following conditions, $\begin{matrix} {{{\min \left\{ \left\lfloor \frac{\tau^{(k)}}{T_{c}} \right\rfloor \right\}} \geq {- L}},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},{{\max \left\{ {\left\lceil \frac{\tau^{(k)}}{T_{c}} \right\rceil + L_{p}^{(k)}} \right\}} \leq L},\quad {k = 0},1,\cdots \quad,{K_{u} - 1},\quad {L < {N_{b}.}}} & (4) \end{matrix}$

where, └x┘ represents the largest integer less than or equal to x, {τ^((k))} are independent and identically distributed by time delays for user k with the uniform distribution over [−αT, αT], T_(c) is the chip duration time, ┌x┐ represents the smallest integer greater than or equal to x, and L_(p) ^((k)) is the number of resolvable paths for user k, here, T=NT_(c) is the symbol period.
 4. The method according to claim 1 further comprising the step of generating the signature sequence as the Park-Song sequence added to the beginning and ending ‘patches’ of itself at both ends. 